A fast quadtree normalization algorithm
نویسندگان
چکیده
Ang, C.-H. and H. Samet, A fast quadtree normalization algorithm, Pattern Recognition Letters 15 (1994) 57 63. A region quadtree representation of an image can be normalized thereby yielding a quadtree that contains the least number of nodes in O(s 2 log2 s) time where s is the length of the grid. A new algorithm is proposed whose asymptotic time bound is the same but whose first part only takes O(s2). It is shown empirically to be able to produce the normalized quadtrees for a number of images in real applications.
منابع مشابه
Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format
Given a compressed image in the restricted quadtree and shading format, this paper presents a fast algorithm for computing 2D discrete cosine transform (DCT) on the compressed grey image directly without the need to decompress the compressed image. The proposed new DCT algorithm takes O(K2 logK + N2) time where the decompressed image is of size N × N and K denotes the number of nodes in the res...
متن کاملFast GPGPU Based Quadtree Construction
We introduce a method for fast quadtree construction on the Graphics Processing Unit (GPU) using a level-by-level approach to quadtree construction. The algorithm is designed to build each subsequent level from the parent nodes of the previous level, and is thus suitable for parallelization. Our work is motivated by the use of General Purpose GPU (GPGPU) techniques for large data sets generally...
متن کاملFast Stereo Matching by Iterated Dynamic Programming and Quadtree Subregioning
The application of energy minimisation methods for stereo matching has been demonstrated to produce high quality disparity maps. However the majority of these methods are known to be computationally expensive, requiring minutes or even hours of computation. We propose a fast minimisation scheme that produces strongly competitive results for significantly reduced computation, requiring only a fe...
متن کاملFast Stereo Matching by Iterated Dynamic Programming and Quadtree Subregioning
The application of energy minimisation methods for stereo matching has been demonstrated to produce high quality disparity maps. However the majority of these methods are known to be computationally expensive, requiring minutes or even hours of computation. We propose a fast minimisation scheme that produces strongly competitive results for significantly reduced computation, requiring only a fe...
متن کاملcient Sparse Matrix - Matrix Multiplication on Multicore Architectures ⇤
We describe a new parallel sparse matrix-matrix multiplication algorithm in shared memory using a quadtree decomposition. Our implementation is nearly as fast as the best sequential method on one core, and scales quite well to multiple cores.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition Letters
دوره 15 شماره
صفحات -
تاریخ انتشار 1994